On linear polygon transformations

On Linear Polygon Transformations

On One-Sided Ideals of Rings of Linear Transformations

Linear Transformations on Matrices *

Even in thi s generality , it is clear that .!l' (I , ~) is a multiplicative se migroup with an ide ntity. The invariant I can be a scalar valued fun ction, e.g. , I (X) = det (X) ; or for that matter it can describe a property, e.g., m can equal M" (C) and I (X) can mean that X is unitary , so that we are simply asking for the s tructure of all linear transformation s T that map the unitary gr...

Linear transformations on codes

This paper studies and classifies linear transformations that connect Hamming distances of codes. These include irreducible linear transformations and their concatenations. Their effect on the Hamming weights of codewords is also studied. Both linear and non-linear codes over fields are considered. We construct a family of pure binary quantum codes using these transformations. It is shown that ...

Polygon Matching and Indexing Under Affine Transformations

Given a collection {Z1, Z2, . . . , Zm} of n-sided polygons in the plane and a query polygon W we give algorithms to find all Zl such that W = f(Zl) with f an unknown similarity transformation in time independent of the size of the collection. If f is a known affine transformation, we show how to find all Zl such that W = f(Zl) in O(n+ log(m)) time. For a pair W,W ′ of polygons we can find all ...